Generalization of Clauses under Implication
نویسندگان
چکیده
منابع مشابه
Generalization of Clauses under Implication
In the area of inductive learning, generalization is a main operation, and the usual deenition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine learning. Almost all inductive learning systems that perform generalization of clauses use the relation-subsumption instead of implication. The main reason is that ...
متن کاملGeneralization of Clauses under Implication 2
In the area of inductive learning, generalization is a main operation, and the usual deenition of induction is based on logical implication. Recently there has been a rising interest in clausal representation of knowledge in machine learning. Almost all inductive learning systems that perform generalization of clauses use the relation-subsumption instead of implication. The main reason is that ...
متن کاملGeneralization under Implication by
The present paper discusses a generalization operator based on the-subsumption ordering between Horn clauses introduced by the author elsewhere. It has been shown that-subsumption is strictly stronger than-subsumption and a local equivalent of generalized subsumption. With some language restrictions it is decidable and possesses some other useful properties. Most importantly it allows deening a...
متن کاملAn Algorithm for Inducing Least Generalization Under Relative Implication
Inductive Logic Programming (ILP) deals with inducing clausal theories from examples basically through generalization or specialization. The specialization and generalization operators used are mainly based on three generality orderings subsumption, implication and implication relative to background knowledge. Implication is stronger than subsumption, but relative implication is more powerful b...
متن کاملGeneralization of Clauses Containing Cross Connections
In the area of inductive learning, generalization is the main operation, and the usual definition of induction is based on logical implication. Plotkin's well-known technique for computing least general generalizations of clauses under θ-subsumption sometimes produces results which are too general with respect to implication. Muggleton has shown that this problem only occurs in one type of gene...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 1995
ISSN: 1076-9757
DOI: 10.1613/jair.194